P 0 i - questions in Underspecified Minimal
نویسنده
چکیده
In this paper, I present Underspecified Minimal Recursion Semantics (UMRS), a representation language that represents structural ambiguities in terms of underspecifica-tion. It is argued that this kind of approach allows for transparent semantic representations and a straightforward syntax-semantics interface. UMRS is a semantic metalanguage, whose expressions describe expressions of an object language and (possibly underspecified) dependences between them. The potential of UMRS will be illustrated by employing it as the semantic component of an HPSG description of iWi-questions.
منابع مشابه
Applying Robust Semantics
Semantic representations provide an abstraction which allows generalisations to be made across very different surface forms and different syntactic formalisms. But deriving conventional semantic representations requires more information than can be extracted from morphology and syntax, even by deep grammars. The standard way of dealing with this is to use underspecified semantic representations...
متن کامل10 th Conference of the Pacific Association for Computational
Semantic representations provide an abstraction which allows generalisations to be made across very different surface forms and different syntactic formalisms. But deriving conventional semantic representations requires more information than can be extracted from morphology and syntax, even by deep grammars. The standard way of dealing with this is to use underspecified semantic representations...
متن کاملI-47: ART Outcome in PCOS Patients
PCOS is still a problem in gynecology and infertility. Especially in ART the problem of PCOS patients is bigger and more highlighted. These patients are prone to over and under stimulation. Strategies to overcome hyper stimulation are: use of metformin, ovarian drilling, use of minimal stimulation, suppressing LH with use of OCP or GnRh analogues, use of GnRh antagonist in COH. But none of thes...
متن کاملA Notion of Semantic Coherence for Underspecified Semantic Representation
The general problem of finding satisfying solutions to constraint-based underspecified representations of quantifier scope is NP-complete. Existing frameworks, including Dominance Graphs, Minimal Recursion Semantics, and Hole Semantics, have struggled to balance expressivity and tractability, in order to cover real natural language sentences with efficient algorithms. We address this trade-off ...
متن کاملAn Efficient Enumeration Algorithm for Canonical Form Underspecified Semantic Representations
We give polynomial-time algorithms for satisfiability and enumeration of underspecified semantic representations in a canonical form. This canonical form brings several underspecification formalisms together into a uniform framework (Manshadi et al., 2008), so the algorithms can be applied to any underspecified representation that can be converted to this form. In particular, our algorithm can ...
متن کامل